Secure and Non-interactive k-NN Classifier Using Symmetric Fully Homomorphic Encryption
نویسندگان
چکیده
“Machine learning as a service” (MLaaS) in the cloud accelerates adoption of machine techniques. Nevertheless, externalization data on raises serious vulnerability issue because it requires disclosing private to provider. This paper deals with this problem and brings solution for K-nearest neighbors (k-NN) algorithm homomorphic encryption scheme (called TFHE) by operating end-to-end encrypted while preserving privacy. The proposed addresses all stages k-NN fully data, including majority vote class-label assignment. Unlike existing techniques, our does not require intermediate interactions between server client when executing classification task. Our has been assessed quantitative variables demonstrated its efficiency large relevant real-world sets scaling well across different parameters simulated data.
منابع مشابه
Secure Signal Processing Using Fully Homomorphic Encryption
This paper investigates the problem of performing signal processing via remote execution methods while maintaining the privacy of the data. Primary focus on this problem is a situation where there are two parties; a client with data or a signal that needs to be processed and a server with computational resources. Revealing the signal unencrypted causes a violation of privacy for the client. One...
متن کاملMinimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interactive zero-knowledge proofs of membership exist for all languages in NP. However, known non-interactive zero-knowledge proofs of membership of NP-languages yield proofs that are larger than the corre...
متن کاملThreshold Fully Homomorphic Encryption and Secure Computation
Cramer, Damgård, and Nielsen [CDN01] show how to construct an efficient secure multiparty computation scheme using a threshold homomorphic encryption scheme that has four properties i) a honest-verifier zero-knowledge proof of knowledge of encrypted values, ii) proving multiplications correct iii) threshold decryption and iv) trusted shared key setup. Naor and Nissim [NN01a] show how to constru...
متن کاملSecure SURF with Fully Homomorphic Encryption
Cloud computing is an important part of today’s world because offloading computations is a method to reduce costs. In this paper, we investigate computing the Speeded Up Robust Features (SURF) using Fully Homomorphic Encryption (FHE). Performing SURF in FHE enables a method to offload the computations while maintaining security and privacy of the original data. In support of this research, we d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-13945-1_11